Type IV codes over a non-unital ring

نویسندگان

چکیده

There is a special local ring [Formula: see text] of order without identity for the multiplication, defined by We study algebraic structure linear codes over that non-commutative ring, in particular their residue and torsion codes. introduce notion quasi self-dual Type IV codes, whose all codewords have even Hamming weight. weight enumerators these means invariant theory, classify them short lengths.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Skew Cyclic Codes over a Finite Ring

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Some Results on Type IV Codes Over

Dougherty, Gaborit, Harada, Munemasa, and Solé have previously given an upper bound on the minimum Lee weight of a Type IV self-dual -code, using a similar bound for the minimum distance of binary doubly even self-dual codes. We improve their bound, finding that the minimum Lee weight of a Type IV self-dual -code of length is at most 4 12 , except when = 4, and = 8 when the bound is 4, and = 16...

متن کامل

Codes over a Non Chain Ring with Some Applications

An significant milestone study in coding theory recognized to be the paper written by Hammons at al. [1]. Fields are useful area for constructing codes but after the study [1] finite ring have received a great deal of attention. Most of the studies are concentrated on the case with codes over finite chain rings. However, optimal codes over nonchain rings exist (e.g see [2].) In [3], et al. stud...

متن کامل

Cyclic and constacyclic codes over a non-chain ring

In this study, we consider linear and especially cyclic codes over the non-chain ring Zp[v]/〈v − v〉 where p is a prime. This is a generalization of the case p = 3. Further, in this work the structure of constacyclic codes are studied as well. This study takes advantage mainly from a Gray map which preserves the distance between codes over this ring and p-ary codes and moreover this map enlighte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra and Its Applications

سال: 2021

ISSN: ['1793-6829', '0219-4988']

DOI: https://doi.org/10.1142/s0219498822501420